A STRATEGY FOR NON-STRICTLY CONVEX TRANSPORT COSTS AND THE EXAMPLE OF ||x− y|| IN R
نویسندگان
چکیده
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat some transport problems, of independent interest, with a convex constraint on the displacement. As an illustration of our strategy, we prove existence of optimal transport maps in the case where the source measure is absolutely continuous with respect to the Lebesgue measure and the transportation cost is of the form h(‖x − y‖) with h strictly convex increasing and ‖.‖ an arbitrary norm in R.
منابع مشابه
A strategy for non-strictly convex transport costs and the example of ||x-y||p in R2
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat some transport problems, of independent interest, with a convex constraint on the displacement. As an illustration of our strategy, we prove existence of opt...
متن کاملA Strategy for Non-strictly Convex Transport Costs and the Example of ||x − Y||
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat some transport problems, of independent interest, with a convex constraint on the displacement. As an illustration of our strategy, we prove existence of opt...
متن کاملEvaluating the Willingness to Pay for Urban Congestion Priced Zones (Case Study of Tehran)
Congestion pricing is one of the major travel demand management policies to reduce traffic volumes in metropolitans. One of the main factors for effective implementation of this policy is to analyze users' response to different toll rates. In this paper, the willingness of users to pay for using their personal cars is evaluated. The stated preference method was applied for data gathering. Sever...
متن کاملConstructing Optimal Maps for Monge’s Transport Problem as a Limit of Strictly Convex Costs
The Monge-Kantorovich problem is to move one distribution of mass onto another as efficiently as possible, where Monge’s original criterion for efficiency [19] was to minimize the average distance transported. Subsequently studied by many authors, it was not until 1976 that Sudakov showed solutions to be realized in the original sense of Monge, i.e., as mappings from R to R [23]. A second proof...
متن کاملOne-for-One Period Policy and its Optimal Solution
In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...
متن کامل